Finding Similar Regions in Many Sequences

Finding Similar Regions in Many Sequences

1 1 Some of the results in this paper have appeared as a part of an extended abstract presented in ''Proc. Algorithms for finding similar, or highly conserved, regions in a group of sequences are at the core of many molecular biology problems. Assume that we are given n DNA sequences s 1 , ..., s n. The Consensus Patterns problem, which has been widely studied in bioinformatics research, in its...

Finding similar situations in sequences of events via random projections

Sequences of events occur in several applications, such as mobile services (the requests made by each user), telecommunication network alarm handling, user interface studies, etc. Such a sequence can be denoted (〈ei, ti〉), where i = 1, . . . , n, and for each i, ei ∈ E is an event type and ti is the occurrence time. As an example, consider the following excerpt from a sequence of 46662 events (...

A new method of finding similarity regions in DNA sequences

Identifying similarity regions inside a DNA sequence (repeats), or between two sequences (local alignment), is a fundamental problem in bioinformatics. For this task, many algorithms use a technique based on searching for small exact repetitions of fixed size (seeds) and trying to extend those into larger approximate repeats. BLAST family [1] is the most prominent representative of this approac...

Finding similar users in Facebook

Online social networks are rapidly asserting themselves as popular services on the Web. A central point is to determine whether two distinct users can be considered similar, a crucial concept with interesting consequences on the possibility to accomplish targeted actions like, for example, political and social aggregations or commercial promotions. In this chapter we propose an approach in orde...

Finding Similar Sets